Frank Kjul Larsen’s reputation

Frank Kjul Larsen's reputation

Total 19
0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
+1
December 13, 2019 Commented Hello GNU tools I have now had the opportunity to test your new toolchain on one of my RX111 targets, and I want to share my impressions with other users. My tests have been using the Windows version and not the one refreshed today. My first impressions is that the binary it produces is denser, faster and contains less errors. My code compiled and executed first time with no modification from the earlier RX 1902_sp1 version. I only changed the path to the new toolchain 6 warnings was issued during compile. I use the following compiler options: # Common options OPTIONS := -DRX111 OPTIONS += -mcpu=rx100 OPTIONS += -nofpu OPTIONS += -mlittle-endian-data # Select little endian operation OPTIONS += -D__RX_LITTLE_ENDIAN__=1 OPTIONS += -std=c11 OPTIONS += -nostartfiles OPTIONS += -Wall OPTIONS += -Wextra OPTIONS += -Wl,--warn-common OPTIONS += -ffunction-sections OPTIONS += -fdata-sections OPTIONS += -Wl,--gc-sections OPTIONS += -DROMSTART OPTIONS += -loptc OPTIONS += -loptm # Optimisation OPTIONS += -O3 # Debug info in file (not with list files) OPTIONS += -g2 The parser found more errors in my code - shown as warnings: - a logical AND that should have been a bitwise AND - an if statement that lacked the {} block. - an snprintf that truncated number to be converted to a string by accident. - a intentionally fall through in a switch. That was not an error. and more. Who needs tools for static code analysis any more? These errors was not found by a very expensive SW analysis tool. The code is even more compact as it was before:-) The code is faster. I used to have a loop time of 500 us and that is now 394 us:-) This new toolchain is certainly worth trying. I think you have done a great job. Thank you so much GNU tools. Best regards Frank Kjul Larsen
+2
October 2, 2018 Asked Will fixed-point math be supported?
+1
August 8, 2016 registration
Support